A spectral proof of the uniqueness of a strongly regular graph with parameters (81, 20, 1, 6)

نویسندگان

  • Dragan Stevanovic
  • Marko Milosevic
چکیده

We give a new proof that there exists a unique strongly regular graph with parameters (81, 20, 1, 6). Unlike the finite geometry approach used by Brouwer and Haemers, we use linear algebra and spectral graph theory concepts, namely the technique of star complements, in our proof. AMS Classification: 05E30, 05C50

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Structure and uniqueness of the (81, 20, 1, 6) strongly regular graph

Brouwer, A.E, W.H. Haemers, Structure and uniqueness of the (81,20, 1.6) strongly regular graph, Discrete Mathematics 106/107 (1992) 77-82. We prove that there is a unique graph (on 81 vertices) with spectrum 20’2”‘(-7)*“. We give several descriptions of this graph, and study its structure. Let r = (X, E) be a strongly regular graph with parameters (v, k, ;1, p) = (81, 20, 1, 6). Then r (that i...

متن کامل

er 10 82 ON A FAMILY OF STRONGLY REGULAR GRAPHS WITH λ = 1 ANDRIY

In this paper, we give a complete description of strongly regular graphs with parameters ((n + 3n − 1), n(n + 3), 1, n(n + 1)). All possible such graphs are: the lattice graph L3,3 with parameters (9, 4, 1, 2), the Brouwer-Haemers graph with parameters (81, 20, 1, 6), and the Games graph with parameters (729, 112, 1, 20).

متن کامل

A Uniqueness Theorem of the Solution of an Inverse Spectral Problem

This paper is devoted to the proof of the unique solvability ofthe inverse problems for second-order differential operators withregular singularities. It is shown that the potential functioncan be determined from spectral data, also we prove a uniquenesstheorem in the inverse problem.

متن کامل

THE SPECTRAL DETERMINATION OF THE MULTICONE GRAPHS Kw ▽ C WITH RESPECT TO THEIR SIGNLESS LAPLACIAN SPECTRA

The main aim of this study is to characterize new classes of multicone graphs which are determined by their signless Laplacian spectra. A multicone graph is defined to be the join of a clique and a regular graph. Let C and K w denote the Clebsch graph and a complete graph on w vertices, respectively. In this paper, we show that the multicone graphs K w ▽C are determined by their signless ...

متن کامل

CERTAIN TYPES OF EDGE m-POLAR FUZZY GRAPHS

In this research paper, we present a novel frame work for handling $m$-polar information by combining the theory of $m-$polar fuzzy  sets with graphs. We introduce certain types of edge regular $m-$polar fuzzy graphs and edge irregular $m-$polar fuzzy graphs. We describe some useful properties of edge regular, strongly edge irregular and strongly edge totally irregular $m-$polar fuzzy graphs. W...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Eur. J. Comb.

دوره 30  شماره 

صفحات  -

تاریخ انتشار 2009